Approximation of conjugate functions by trigonometric polynomials in weighted Orlicz spaces

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation by Trigonometric Polynomials in Weighted Rearrangement Invariant Spaces

We investigate the approximation properties of trigonometric polynomials and prove some direct and inverse theorems for polynomial approximation in weighted rearrangement invariant spaces.

متن کامل

Approximation By Trigonometric Polynomials

These notes are prepared as lecture notes exclusively for the participants of this conference only. Any reproduction in any media, or any use for any other purpose of any part of this manuscript, without an expressed written consent of the author is unlawful.thorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon. The views and conc...

متن کامل

Approximation by weighted polynomials

It is proven that if xQ′(x) is increasing on (0,+∞) and w(x) = exp(−Q) is the corresponding weight on [0,+∞), then every continuous function that vanishes outside the support of the extremal measure associated with w can be uniformly approximated by weighted polynomials of the form wPn. This problem was raised by V. Totik, who proved a similar result (the Borwein-Saff conjecture) for convex Q. ...

متن کامل

On difference sequence spaces defined by Orlicz functions without convexity

In this paper, we first define spaces of single difference sequences defined by a sequence of Orlicz functions without convexity and investigate their properties. Then we extend this idea to spaces of double sequences and present a new matrix theoretic approach construction of such double sequence spaces.  

متن کامل

Discrete Least Squares Approximation by Trigonometric Polynomials

We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Inequalities

سال: 2013

ISSN: 1846-579X

DOI: 10.7153/jmi-07-25